A New Distributed Localization Method for Sensor Networks

This paper studies the problem of determining the sensor locations in a large sensor network using relative distance (range) measurements only. Our work follows from a seminal paper by Khan et al. [1] where a distributed algorithm, known as DILOC, for sensor localization is given using the barycentric coordinate. A main limitation of the DILOC algorithm is that all sensor nodes must be inside the convex hull of the anchor nodes. In this paper, we consider a general sensor network without the convex hull assumption, which incurs challenges in determining the sign pattern of the barycentric coordinate. A criterion is developed to address this issue based on available distance measurements. Also, a new distributed algorithm is proposed to guarantee the asymptotic localization of all localizable sensor nodes

New results on node localizable conditions for sensor networks

This paper studies the problem of localizable conditions for sensor nodes in a two-dimensional sensor network. A new group of conditions are proposed which judge each node's localizability through analyzing its connections with not only a set of already localized nodes but also its other neighbors. Our new conditions allow up to four nodes to be localized at a time. This algorithm offers a substantial improvement in localizability over the well-known trilateration method and convex hull method. We show that a newly developed WHEEL extension condition is a special case of our conditions. We also demonstrate that our result can be used as a guideline to modify topology of a network for better localizability

Cooperative localization of a cascading quadrilateral network

In this paper, we introduce a set of sensor networks, called the cascading quadrilateral network, and study how to compute the positions of its nodes in a cooperative way. We investigate the condition for determining whether all the sensor nodes are localizable. If not, we provide a method to detect the un-localizable nodes for the whole network. The necessary and sufficient conditions for the network localizability and node localizability are given from the view of algebraic property, respectively. Specifically, we provide algorithms to show how to detect un-localizable nodes from a partially localizable network. Numerical simulation is provided to show the effectiveness of the developed method of computing positions